Analog Rotating Ring Decoder for an LDPC Convolutional Code
نویسندگان
چکیده
We present an analog rotating ring decoder for decoding an LDPC convolutional code. The decoder architecture uses a window of soft received L-values K time units in the past and K time units in the future to decode a given bit. The window of 2K + 1 time units is arranged in a ring structure, and decoding proceeds in a continuous fashion by rotating around the ring. Simulation results indicate performance almost identical to that achieved with digital decoding.
منابع مشابه
On the Enhancement of LDPC Codes Used in WiMAX
In this paper the low density party check (LDPC) codes used in the IEEE 802.16 standard physical layer are studied, and two novel techniques to enhance the performance of such codes are introduced. In the first technique, a novel parity check matrix for LDPC codes over GF(4) with the non-zero entries chosen to maximize the entropy is proposed, the parity check matrix is based on the binary pari...
متن کاملA Programmable Decoder for LDPC Convolutional Codes: From Graph Properties to Hardware Realization
This contribution aims at unveiling the properties of the Tanner graphs underlying LDPC convolutional codes that can be used for efficient decoder implementations. We will also shown an implementation example of a simple programmable architecture that was obtained applying these graph properties.
متن کاملDesign of Generalized LDPC Codes and their Decoders
We first consider the design of generalized LPDC (G-LDPC) codes with recursive systematic convolutional (RSC) constraint nodes in place of the standard single parity check constraint nodes. Because rate-1/2 RSC nodes lead to low-rate G-LDPC codes, we consider high-rate tail-biting RSC nodes for which Riedel’s APP-decoder based on the reciprocal-dual code trellis becomes necessary. We present th...
متن کاملOn Generalized LDPC Codes and Their Decoders
We first consider the design of generalized LPDC (G-LDPC) codes with recursive systematic convolutional (RSC) constraint nodes in place of the standard single parity-check constraint nodes. Because rate-1/2 RSC nodes lead to low-rate G-LDPC codes, we consider high-rate tail-biting RSC nodes for which Riedel’s APP-decoder based on the reciprocal-dual code trellis becomes necessary. We then consi...
متن کاملA Flexible LDPC/Turbo Decoder Architecture
Low-density parity-check (LDPC) codes and convolutional Turbo codes are two of the most powerful error correcting codes that are widely used in modern communication systems. In a multi-mode baseband receiver, both LDPC and Turbo decoders may be required. However, the different decoding approaches for LDPC and Turbo codes usually lead to different hardware architectures. In this paper we propose...
متن کامل